Natural computation and non-Turing models of computation
نویسندگان
چکیده
منابع مشابه
Natural computation and non-Turing models of computation
We propose certain non-Turing models of computation, but our intent is not to advocate models that surpass the power of Turing machines (TMs), but to defend the need for models with orthogonal notions of power. We review the nature of models and argue that they are relative to a domain of application and are ill-suited to use outside that domain. Hence we review the presuppositions and context ...
متن کامل- 1 - Natural Computation and Non - Turing Models of Computation
We propose certain non-Turing models of computation, but our intent is not to advocate models that surpass the power of Turing Machines (TMs), but to defend the need for models with orthogonal notions of power. We review the nature of models and argue that they are relative to a domain of application and are ill-suited to use outside that domain. Hence we review the presuppositions and context ...
متن کاملOn non-Turing models of computation
© 1997 John Wiley & Sons, Inc. John Casti received his Ph.D. in mathematics under Richard Bellman at the University of Southern California in 1970. He worked at the RAND Corporation in Santa Monica, CA, and served on the faculties of the University of Arizona, NYU, and Princeton before becoming one of the first members of the research staff at the International Institute for Applied Systems Ana...
متن کاملNoise, physics, and non-Turing computation
It has been proven that recurrent neural networks with analog weights can solve problems that are insoluble using Turing machines. However, the prevailing view of those involved in computing research is that a) nonTuring computation is unnecessary for intelligence and b) machines with non-Turing abilities cannot be built in practice. Two reasons are commonly cited for this. First, the effects o...
متن کاملModels of Computation Lecture : Turing Machines [fa''']
Although Turing did not know it at the time, he was not the first to prove that the Entscheidungsproblem had no algorithmic solution. The first such proof is implicit in the work of Kurt Gödel; in lectures on his incompleteness theorems2 at Princeton in 1934, Gödel described a model of general recursive functions, which he largely credited to Jacques Herbrand.3 Gödel’s incompleteness theorem ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00635-2